Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons
نویسندگان
چکیده
We consider the approximation of two NP-hard problems: Minkowski Decomposition (MinkDecomp) of integral lattice polygons, and the related Multidimensional Subset Sum (kD-SS). We prove, through a gap-preserving reduction, that, for general dimension k, kD-SS does not have an FPTAS. For 2D-SS, we present an O(n/ ) approximation algorithm, where n is the set cardinality and bounds the approximation, and use it to approximate MinkDecomp.
منابع مشابه
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine diierent methods for decomposing polygons by their suitability for eecient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experimen...
متن کاملPii: S0925-7721(01)00041-4
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decomposing polygons by their suitability for efficient construction of Minkowski sums. We study and experiment with various well-known decompositions as well as with several new decomposition schemes. We report on our experi...
متن کاملExact Minkowski Sums of Polygons With Holes
We present an efficient algorithm that computes the Minkowski sum of two polygons, which may have holes. The new algorithm is based on the convolution approach. Its efficiency stems in part from a property for Minkowski sums of polygons with holes, which in fact holds in any dimension: Given two polygons with holes, for each input polygon we can fill up the holes that are relatively small compa...
متن کاملDynamic Minkowski sums under scaling
In many common real-world and virtual environments, there are a significant number of repeated objects, primarily varying in size. Similarly, in many complex machines, there are a significant number of parts which also vary in size rather than shape. This repetition saves in both design and production costs. Recent research in robotics has also shown that exploiting workspace repetition can sig...
متن کاملMinkowski decomposition of convex lattice polygons
A relatively recent area of study in geometric modelling concerns toric Bézier patches. In this line of work, several questions reduce to testing whether a given convex lattice polygon can be decomposed into a Minkowski sum of two such polygons and, if so, to finding one or all such decompositions. Other motivations for this problem include sparse resultant computation, especially for the impli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics in Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2017